Classification of Self-Orthogonal Codes over F3 and F4
نویسندگان
چکیده
Several methods for classifying self-orthogonal codes up to equivalence are presented. These methods are used to classify self-orthogonal codes with largest possible minimum distance over the fields F3 and F4 for lengths n ≤ 29 and small dimensions (up to 6). Some properties of the classified codes are also presented. In particular, an extensive collection of quantum error-correcting codes is obtained.
منابع مشابه
Construction of quasi-cyclic self-dual codes
There is a one-to-one correspondence between l-quasi-cyclic codes over a finite field Fq and linear codes over a ring R = Fq[Y ]/(Y m − 1). Using this correspondence, we prove that every l-quasi-cyclic self-dual code of length ml over a finite field Fq can be obtained by the building-up construction, provided that char (Fq) = 2 or q ≡ 1 (mod 4), m is a prime p, and q is a primitive element of F...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملFormally self-dual additive codes over F4
We introduce a class of formally self-dual additive codes over F4 as a natural analogue of binary formally self-dual codes, which is missing in the study of additive codes over F4. We define extremal formally self-dual additive codes over F4 and classify all such codes. Interestingly, we find exactly three formally self-dual additive (7, 27) odd codes over F4 with minimum distance d = 4, a bett...
متن کاملSome Strongly Regular Graphs and Self-orthogonal Codes from the Unitary
We construct self-orthogonal codes from the row span over F2 or F3 of the adjacency matrices of some strongly regular graphs defined by the rank-3 action of the simple unitary group U4(3) on the conjugacy classes of some of its maximal subgroups. We establish some properties of these codes and the nature of some classes of codewords.
متن کاملSome new bounds on LCD codes over finite fields
In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD(n, 2) over F3 and F4. We study the bound of LCD codes over Fq.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 19 شماره
صفحات -
تاریخ انتشار 2005